On Intersections of Small Perfect Sets
نویسنده
چکیده
For a not empty perfect subset of the unit circle C there is a perfect subset of C measure zero which being rotated to every position intersects the first set on a nonempty perfect set. This result may be stated in terms of set of distances between pairs of points from these two sets. A generalization of this result to a product of tori is suggested. 2000 Mathematics Subject Classification: 26-XX, 28-XX.
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملOn generalizations of semiperfect and perfect rings
We call a ring $R$ right generalized semiperfect if every simple right $R$-module is an epimorphic image of a flat right $R$-module with small kernel, that is, every simple right $R$-module has a flat $B$-cover. We give some properties of such rings along with examples. We introduce flat strong covers as flat covers which are also flat $B$-covers and give characterizations of $A$-perfe...
متن کاملEstimating the Safety Benefits of Red Light Cameras at Signalized Intersections in Urban Areas Case Study: The City of Virginia Beach
The Highway Safety Manual [HSM, 2010] recommends safety evaluations be performed before implementing any roadway treatment to predict the expected safety consequences. Safety consequences can be measured using crash prediction models, Crash Modification Factor (CMFs), or both. This paper develops a CMF to show the expected impact of red-light cameras (RLCs) on safety at signalized intersections...
متن کاملOn the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
Let P and Q be disjoint point sets with 2k and 2l elements respectively, and M1 and M2 be their minimum weight perfect matchings (with respect to edge lengths). We prove that the edges of M1 and M2 intersect at most |M1| + |M2| − 1 times. This bound is tight. We also prove that P and Q have perfect matchings (not necessarily of minimum weight) such that their edges intersect at most min{r, s} t...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کامل